A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems

نویسندگان

  • Qingde Kang
  • Yanxun Chang
چکیده

In what follows, an ordered pair will always be an ordered pair (x, y), where x # y. A transitive triple is a collection of three ordered pairs of the form (6, Y), (Y, z), (x, z)}, which we will always denote by (x, y, z). A transitive triple system (TTS(u)) is a pair (X, B), where X is a set containing v elements and B is a collection of transitive triples of elements of X such that every ordered pair of elements of X belongs to exactly one transitive triple of B. It is well known that the spectrum for TTS(U) is the set of all v = 0 or 1 (mod 3). It is easy to see that if (X, B) is a TTS(u) then (BI = v(u 1)/3. A large set of pairwise disjoint TTS(v)s is a collection of 3(v-2) pairwise disjoint TTS(v)s. It is denoted by LTTS(o). Up to now, all known results about LTTS(V) are (see [l-3])

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharply $(n-2)$-transitive Sets of Permutations

Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...

متن کامل

PROPERTY ANALYSIS OF TRIPLE IMPLICATION METHOD FOR APPROXIMATE REASONING ON ATANASSOVS INTUITIONISTIC FUZZY SETS

Firstly, two kinds of natural distances between intuitionistic fuzzy sets are generated by the classical natural distance between fuzzy sets under a unified framework of residual intuitionistic implication operators. Secondly, the continuity and approximation property of a method for solving intuitionistic fuzzy reasoning are defined. It is proved that the triple implication method for intuitio...

متن کامل

Reliability assessment of power distribution systems using disjoint path-set algorithm

Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...

متن کامل

Partitioning sets of oriented triples into the smallest nontrivial oriented triple systems

We study partitions of the set of all cyclic (respectively, transitive) triples chosen from a v-set into pairwise disjoint MTS(4)s (respectively, DTS(4)s). We find necessary conditions for the partitions. Furthermore, we prove that the necessary conditions for the partitions are also sufficient.

متن کامل

Further results about large sets of disjoint Mendelsohn triple systems

Kang, Q. and Y. Chang, Further results about large sets of disjoint Mendelsohn triple systems, Discrete Mathematics 118 (I 993) 2633268. In this note, a construction of the large sets of pairwise disjoint Mendelsohn triple systems of order 72k + 6, where k > 1 and k F 1 or 2 (mod 3), is given. Let X be a set of v elements (v 2 3). A cyclic triple from X is a collection of three pairs (x, y), (y...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 60  شماره 

صفحات  -

تاریخ انتشار 1992